Overview of Binary Locally Repairable Codes for Distributed Storage Systems
نویسندگان
چکیده
منابع مشابه
Hybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملRegenerating Codes and Locally Recoverable Codes for Distributed Storage Systems
We survey the recent results on applying error control coding to distributed storage systems. In such systems, errors often happen in a burst manner, or maybe only one storage node in the whole distributed system fails. Therefore, only a small amount of information, e.g., one data fragment, has to be recovered. Therefore, accessing the whole data is unnecessary. Especially, we focus on regenera...
متن کاملBounds on Binary Locally Repairable Codes Tolerating Multiple Erasures
Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are over fields with size that grows with the number of servers, which makes the systems computationally expensive and difficult to maintain. Here, we study linear locally repairable codes over the binary field, tolerating m...
متن کاملOptimal binary linear locally repairable codes with disjoint repair groups
In recent years, several classes of codes are introduced to provide some fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) play an important role. However, most known constructions are over large fields with sizes close to the code length, which lead to the systems computationally expensive. Due to this, binary...
متن کاملOn Sequential Locally Repairable Codes
We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n, k, r, t)SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t(≤ t) erasures can be sequentially recovered, each one by r (2 ≤ r < k) other code symbols. Sequential recovering means that the erased symbols are recovered one by one, and an already recovere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2019
ISSN: 2079-9292
DOI: 10.3390/electronics8060596